Magic sets and stratified databases

نویسنده

  • Yangjun Chen
چکیده

This paper considers the efficient bottom-up query evaluation for stratified databases. We investigate the applicability of magic-set method to stratified databases containing negative body literals and show that culprit cycles cause unstratification. Based on the analysis, we present a labeling algorithm to distinguish the context for constructing magic sets, which is simpler and more efficient than the algorithms proposed by Balbin et al. [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magic Sets for Disjunctive Datalog Programs

In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the propagation of query bindings and extends the Magic Set optimization technique (originally defined for non-disjunctive programs). An important feature of disjunctive Datalog programs is nonmonotonicity, which calls f...

متن کامل

The HiLeX System for Semantic Information Extraction

In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the propagation of query bindings and extends the Magic Set optimization technique (originally defined for non-disjunctive programs). An important feature of disjunctive Datalog programs is nonmonotonicity, which calls f...

متن کامل

Dynamic Magic Sets for Super-Consistent Answer Set Programs

For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore query optimization techniques for ASP are of great interest. Magic Sets are one of these techniques, originally defined for Datalog queries (ASP without disjunction and negation). Dynamic Magic Sets (DMS) are an extension of this technique, which has been proved to be s...

متن کامل

Update Propagation in Deductive Databases Using Soft Stratification

Update propagation in deductive databases can be implemented by combining rule rewriting and fixpoint computation, analogous to the way how query answering is performed via Magic Sets. For efficiency reasons, bottom-up propagation rules have to be subject to Magic rewriting, thus possibly loosing stratifiability. We propose to use the soft stratification approach for computing the well-founded ...

متن کامل

Soft stratification for transformation-based approaches to deductive databases

The efficient evaluation of recursive views is a crucial issue in the research field of deductive databases. Results in this area are especially relevant for systems which will implement the new SQL:1999 standard, and hence will allow the definition of stratifiable recursive views. In particular, transformation-based solutions to query evaluation seem to be well-suited for extending existing re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Intell. Syst.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1997